Cache-Conscious Query Processing

نویسنده

  • Kenneth A. Ross
چکیده

Foundations A cache is a hardware unit that speeds up access to data. Several cache units may be present at various levels of the memory hierarchy, depending on the processor architecture. For example, a processor may have a small but fast Level-1 (L1) cache for data, and another L1 cache for instructions. The same processor may have a larger but slower L2 cache storing both data and instructions. Some processors may even have an L3 cache. On multicore processors, the lower level caches may be shared among groups of cores. Some initial analysis would typically be performed to determine the performance characteristics of a workload. For example, Ailamaki et al. [1] used hardware performance counters to demonstrate that several commercial systems were, at that time, suffering many L2 data cache misses and L1 instruction cache misses. Based on such observations, one can determine that the L2 data cache and L1 instruction cache are targets for performance tuning. If the operating system does not provide direct access to system parameters such as the cache size, a database system can run a calibration test to estimate the relevant parameters [13]. To get good cache performance, algorithm designers typically utilize one or more of the following general approaches:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cache Conscious Algorithms for Relational Query Processing

The current main memory (DRAM) access speeds lag far behind CPU speeds. Cache memory, made of static RAM, is being used in today’s architectures to bridge this gap. It provides access latencies of 2-4 processor cycles, in contrast to main memory which requires 15-25 cycles. Therefore, the performance of the CPU depends upon how well the cache can be utilized. We show that there are significant ...

متن کامل

Buffering Accesses to Memory-Resident Index Structures

Recent studies have shown that cacheconscious indexes outperform conventional main memory indexes. Cache-conscious indexes focus on better utilization of each cache line for improving search performance of a single lookup. None has exploited cache spatial and temporal locality between consecutive lookups. We show that conventional indexes, even “cache-conscious” ones, suffer from significant ca...

متن کامل

Fast Query Processing Using Cooperative CPU Caching for Index Structures

Index data structures are an important component of database applications. Our measurements show that for a memory resident CSB+-tree (Cache Sensitive B+ tree), the cache miss penalty now accounts for over 50% of the total running time. This is exacerbated by current trends. As a result of Moore’s law, both the CPU speed and the DRAM density have doubled every 18 months. However the cache miss ...

متن کامل

CQP-Miner: Mining Conserved XML Query Patterns For Evolution-Conscious Caching

Existing xml query pattern-based caching strategies focus on extracting the set of frequently issued query pattern trees (qpt) based on the support of the qpts in the history. These approaches ignore the evolutionary features of the qpts. In this paper, we propose a novel type of query pattern called conserved query paths (cqp) for efficient caching by integrating the support and evolutionary f...

متن کامل

On the Discovery of Conserved XML Query Patterns for Evolution-Conscious Caching

Existing xml query pattern-based caching strategies focus on extracting the set of frequently issued query pattern trees (qpt) based on the support of the qpts in the history. These approaches ignore the evolutionary features of the qpts. In this paper, we propose a novel type of query pattern called conserved query paths (cqp) for efficient caching by integrating the support and evolutionary f...

متن کامل

Cache-Oblivious Databases: Limitations and Opportunities1

Cache-oblivious techniques, proposed in the theory community, have optimal asymptotic bounds on the amount of data transferred between any two adjacent levels of an arbitrary memory hierarchy. Moreover, this optimal performance is achieved without any hardware platform specific tuning. These properties are highly attractive to autonomous databases, especially because the hardware architectures ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009